State complexity of the concatenation of regular tree languages
نویسندگان
چکیده
منابع مشابه
State Complexity of Regular Tree Languages for Tree Pattern Matching
We study the state complexity of regular tree languages for tree matching problem. Given a tree t and a set of pattern trees L, we can decide whether or not there exists a subtree occurrence of trees in L from the tree t by considering the new language L′ which accepts all trees containing trees in L as subtrees. We consider the case when we are given a set of pattern trees as a regular tree la...
متن کاملState Complexity of Kleene-Star Operations on Regular Tree Languages
The concatenation of trees can be defined either as a sequential or a parallel operation, and the corresponding iterated operation gives an extension of Kleene-star to tree languages. Since the sequential tree concatenation is not associative, we get two essentially different iterated sequential concatenation operations that we call the bottom-up star and top-down star operation, respectively. ...
متن کاملState Complexity of Regular Languages
State complexity is a descriptive complexity measure for regular languages. We investigate the problems related to the state complexity of regular languages and their operations. In particular, we compare the state complexity results on regular languages with those on nite languages.
متن کاملState Complexity of Prefix-Free Regular Languages
We investigate the state complexities of basic operations for prefix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton (DFA) that accepts the language obtained from the operation. We know that a regular language is prefix-free if and o...
متن کاملReversal of regular languages and state complexity
We study the state complexity of languages that can be obtained as reversals of regular languages represented by deterministic finite automata. We show that the state complexity of the reversal of a regular language with state complexity n is between logn and 2. We first prove that the upper bound is tight in the ternary case. Then we present binary languages reaching this upper bound on the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.12.048